Membership in Constant Time and Minimum Space
نویسندگان
چکیده
We investigate the problem of storing a subset of the elements of a boundeduniverse so that searches can be performed in constant time and the space used is within a constant factor of the minimum required. Initially we focus on the static version of this problem and conclude with an enhancement that permits insertions and deletions.
منابع مشابه
Membership in Constant Time and Almost-Minimum Space
This paper deals with the problem of storing a subset of elements from the bounded universeM = {0, . . . ,M−1} so that membership queries can be performed efficiently. In particular, we introduce a data structure to represent a subset of N elements of M in a number of bits close to the information-theoretic minimum, B = ⌈ lg ( M N )⌉ , and use the structure to answer membership queries in const...
متن کاملNear-Minimum Time Optimal Control of Flexible Spacecraft during Slewing Maneuver
The rapid growth of space utilization requires extensive construction, and maintenance of space structures and satellites in orbit. 
This will, in turn, substantiate application of robotic systems in space. In this paper, a near-minimum-time optimal control law is developed for a rigid space platform with flexible links during an orientating maneuver with large angle of rotation. The time op...
متن کاملNear-Minimum Time Optimal Control of Flexible Spacecraft during Slewing Maneuver
The rapid growth of space utilization requires extensive construction, and maintenance of space structures and satellites in orbit. This will, in turn, substantiate application of robotic systems in space. In this paper, a near-minimum-time optimal control law is developed for a rigid space platform with flexible links during an orientating maneuver with large angle of rotation. The time opti...
متن کاملNear-Minimum-Time Motion Planning of Manipulators along Specified Path
The large amount of computation necessary for obtaining time optimal solution for moving a manipulator on specified path has made it impossible to introduce an on line time optimal control algorithm. Most of this computational burden is due to calculation of switching points. In this paper a learning algorithm is proposed for finding the switching points. The method, which can be used for both ...
متن کاملLearning Disjunctions of Predicates
LetF be a set of boolean functions. We present an algorithm for learningF∨ := {∨f∈Sf | S ⊆ F} from membership queries. Our algorithm asks at most |F| ·OPT(F∨) membership queries where OPT(F∨) is the minimum worst case number of membership queries for learning F∨. When F is a set of halfspaces over a constant dimension space or a set of variable inequalities, our algorithm runs in polynomial tim...
متن کامل